The computational complexity of dominance and consistency in CP-nets
نویسندگان
چکیده
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted classes in which theestigateCede(ome)Tj 24.2204 0 Td y dominanc628041 0 Td (comple)T7112 0 Td ( 0 Td n)Tj 10937457 0 Tdis the atslaw78.6Tj -4Cede(ome)Tj 24.2204 0 Td y lar gxington,944j 47.215.9ominanc39040.0242 (c Td T 18229.3594 0numb92 Td (2224283j 21.8212 0 (dominanc38Tj 47.215at0 Tbp)Tj11.8603 0 Td (ute(Up)Tj2 -37075.1613 T(c92 (reKY)Tj 5j065.7749 0 AIomina -)Tj47 0 Td r searc(c9s)Tj 471.8647 0 Td ha)Tj 917227801 0 Tdestigate)Tj 35.2458 )Tj 6.4333j 47.215de lan-35(72te238te)Tj 35. Tdguag(in)Tj 103.740.0242 (restrict26)Tj 39.9206pres13. (domin5nce96.56 0 Tdprefc92 (h)Tj 46.58j 35.2458or (r (dsY)Tj 15268 47.215succinctl71 Td ( ́90T801 0 TdUp)Tj5.99.7041 0 Td (compu(72te22j -4)Tj 47.58 (rmalism)Tj 46.715.2083 0 (dominanc98Tj 47.215 0 Td (epta3nce)740. 839997.215[epta3.36001)Tj 839997.215Boutil.92 Td 3.98-17.4 Td (W)es)0822 0 Td (d n)Tj)Tj 1 0 Td (ialUp)Tj0.6 -17.4 Td (W)4)T3015 0 Td (the)Tj 470767 0 Td (er)domin 10917041 0 Td (compl(7ej 833j 21.8212 0 mo 0n)Tj2 /77 1105. Tdpopular)Tj 3062618 0 Td on1(Up)Tj2j 481.3789 -1A a Centr2j 01585 0 Td (dominanc69)556 0 Tdprefc92 (h)Tj 45T301 35.2458or (r (dlassete154.56 0 Td(Centra -30467 0 Td (ut Tdef -404)T58608 0 Td (CP-netTj 17.2083 0 9ermsY)Tj2 1536.2083 0 (dominanc69)556 0 Tdloc(compl(7230.21Tj4Tj 35. Tdprefc92 (h)Tj 46..8647 0 Td Tdat(m13.sY)Tj46.99467 0 Td (K)Tj 81194810.0242 (c Td T 11 29.3594 0 (rmp)Tj0.21T17.4 Td (W)2 /R367 0 Td (pp)Tj0.24T17.4 Td (W)9.59)T613 0 Td:p)Tj0.21T17.4 Td (W)ai239608 0 Td xp)Tj0.27 j 970.5 (W) 180602 -40.6001) Td (p)Tj0.21T17.4 Td (W)ai96001)40.6001) Td > c92 Td 0.21T17.4 Td (W)2 -190.82 63.5xpp
منابع مشابه
modeling and reasoning about preferences with cp - nets
Structured modeling of ceteris paribus qualitative preference statements, grounded in the notions of preferential independence, has tremendous potential to provide effective and efficient tools for modeling and reasoning about decision maker preferences in real-life applications. Within the AI and phylosophical logic communities, past work on qualitative preference representation has tended to ...
متن کاملMore-or-Less CP-Networks
Preferences play an important role in our everyday lives. CP-networks, or CP-nets in short, are graphical models for representing conditional qualitative preferences under ceteris paribus (“all else being equal”) assumptions. Despite their intuitive nature and rich representation, dominance testing with CP-nets is computationally complex, even when the CP-nets are restricted to binary-valued pr...
متن کاملThe Treewidth of Induced Graphs of Conditional Preference Networks Is Small
Conditional preference networks (CP-nets) are recently an emerging topic as a graphical model for compactly representing ordinal conditional preference relations on multi-attribute domains. As we know, the treewidth, which can decrease the solving complexity for many intractability problems, is exactly a fundamental property of a graph. Therefore, we can utilize treewidth to solve some reasonin...
متن کاملEfficient heuristic approach to dominance testing in CP-nets
CP-net (Conditional Preference Network) is one of the extensively studied languages for representing and reasoning with preferences. The fundamental operation of dominance testing in CP-nets, i.e. determining whether an outcome is preferred to another, is very important in many real-world applications. Current techniques for solving general dominance queries is to search for improving flipping ...
متن کاملProbabilistic Conditional Preference Networks
This paper proposes a “probabilistic” extension of conditional preference networks as a way to compactly represent a probability distributions over preference orderings. It studies the probabilistic counterparts of the main reasoning tasks, namely dominance testing and optimisation from the algorithmical and complexity viewpoints. Efficient algorithms for tree-structured probabilistic CP-nets a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Artif. Intell. Res.
دوره 33 شماره
صفحات -
تاریخ انتشار 2005